On computing Fréchet distance of two paths on a convex polyhedron
نویسندگان
چکیده
We present a polynomial time algorithm for computing Fréchet distance between two simple paths on the surface of a convex polyhedron.
منابع مشابه
On Computing the Fréchet Distance Between Surfaces
We describe two (1 + ε)-approximation algorithms for computing the Fréchet distance between two homeomorphic piecewise linear surfaces R and S of genus zero and total complexity n, with Fréchet distance δ. 1. A 2 (( n+ Area(R)+Area(S) (εδ)2 )2) time algorithm if R and S are composed of fat triangles (triangles with angles larger than a constant). 2. An O(D/(εδ)2) · n + 2O(D/(εδ)) time algorithm...
متن کاملPractical Methods for Approximating Shortest Paths on a Convex Polytope in R3
We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let d{subscript p}(p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2*d{subscript p}(p,q) in time O(n). Ex...
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملComputing the Fréchet distance between simple polygons
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.
متن کاملLecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex
Figure 1: Two greatly different curves have a small Hausdroff distance Fréchet distance is a good similarity measurement for curves in Euclidean space. It can be simply described by a daily example. Suppose a dog and its owner are walking along two different paths (curves), connected by a leash. Both of them are moving continuously and forwards only, at any speed or even stop. Then length of th...
متن کامل